Uniform codes

نویسنده

  • James L. Massey
چکیده

Abslracf-For any prime-power Q, it is shown that there exist q-ary convolutional codes with the equidistance property that every code word is at the same distance from all code words disagreeing in the information digits to be decoded. These codes are called “uniform codes” and it is shown that they can be encoded in a very simple manner. The block codes most similar to uniform codes are the maximal-length codes which also have the equidistance property. It is shown that the error performance of these classes of codes is nearly identical but that the uniform codes have simpler encoding circuits. This latter fact is of importance in space applications, which is the most likely use for these codes.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multilevel Input Ring-Tcm Coding Scheme: a Method for Generating High-Rate Codes

The capability of multilevel input ring-TCM coding scheme for generating high-rate codes with improved symbol Hamming and squared Euclidean distances is demonstrated. The existence of uniform codes and the decoder complexity are also considered.

متن کامل

Geometrically uniform hyperbolic codes

In this paper we generalize the concept of geometrically uniform codes, formerly employed in Euclidean spaces, to hyperbolic spaces. We also show a characterization of generalized coset codes through the concept of G-linear codes. Mathematical subject classification: 14L35, 94B60.

متن کامل

Optimal combinatorial batch codes based on block designs

Batch codes, introduced by Ishai, Kushilevitz, Ostrovsky and Sahai, represent the distributed storage of an n-element data set on m servers in such a way that any batch of k data items can be retrieved by reading at most one (or more generally, t) items from each server, while keeping the total storage over m servers equal to N . This paper considers a class of batch codes (for t = 1), called c...

متن کامل

Linear Codes with Non-Uniform Error Correction Capability

This paper introduces a class of linear codes which are non-uniform error correcting, i.e. they have the capability of correcting different errors in different codewords. A technique for specifying error characteristics in terms of algebraic inequalities, rather than the traditional spheres of radius e, is used. A construction is given for deriving these codes from known linear block codes. Thi...

متن کامل

Quantization Using Permutaton Codes with a Uniform Source

Permutation coding is a block coding/quantization scheme where the codebook is comprised entirely of permutations of a single starting vector. Permutation codes for the uniform source are developed using a simple algorithm. The performance of these codes is compared against scalar codes and permutation codes developed by different methodologies. It is shown that the algorithm produces codes as ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 12  شماره 

صفحات  -

تاریخ انتشار 1966